Multiroute flows: Cut-trees and realizability
نویسندگان
چکیده
منابع مشابه
Multiroute flows: Cut-trees and realizability
In the context of q-route flows in an undirected network with non-negative edge capacities, for integer values of q 2, we consider two problems of both theoretical and practical interest. The first problem focuses on investigating the existence and construction of a cut-tree. For q = 2, we show that a cut-tree always exists and can be constructed in strongly polynomial time. However, for q 3, i...
متن کاملOn multiroute maximum flows in networks
Let G = (N, A) be a network with a designated source node s, a designated sink node t, and a finite integral capacity uij < U on each arc (ij) E A. An elementary K-flow is a flow of K units from s to t such that the flow on each arc is 0 or 1. A K-route flow is a flow from s to t that may be expressed as a non-negative linear sum of elementary Kflows. In this paper, we show how to determine a m...
متن کاملCongestion Minimization for Multipath Routing via Multiroute Flows
Congestion minimization is a well-known routing problem for which there is an O(logn/ log logn)approximation via randomized rounding [17]. Srinivasan [18] formally introduced the low-congestion multi-path routing problem as a generalization of the (single-path) congestion minimization problem. The goal is to route multiple disjoint paths for each pair, for the sake of fault tolerance. Srinivasa...
متن کاملExpansion Trees with Cut
Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first-and higher-order logic by recording the information which instances have been chosen for which quantifiers, known in the literature as expansion trees. Such a representation is inherently analytic and hence corresponds to a cut-f...
متن کاملAnalytic Cut Trees
Smullyan maintains that the importance of cut-free proofs does not stem from cut elimination per se but rather from the fact that they satisfy the subformula property. In accordance with such a viewpoint in this paper we introduce analytic cut trees, a system from which cuts cannot be eliminated but satisfying the subformula property. Like tableaux analytic cut trees are a refutation system but...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2005
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2005.03.005